An Efficient Measure of Compactness for 2D Shapes and its Application in Regionalization Problems
نویسندگان
چکیده
A measure of shape compactness is a numerical quantity representing the degree to which a shape is compact. Ways to provide an accurate measure have been given great attention due to its application in a broad range of GIS problems, such as detecting clustering patterns from remote sensing images, understanding urban sprawl, and redrawing electoral districts to avoid gerrymandering. In this paper, we propose an effective and efficient approach to computing shape compactness based on the Moment of Inertia (MI), a well-known concept in physics. The mathematical framework and the computer implementation for both raster and vector models are discussed in detail. In addition to computing compactness for a single shape, we propose a computational method that is capable of calculating the variations in compactness as a shape grows or shrinks, which is a typical application found in regionalization problems. We conducted a number experiments that demonstrate the superiority of the MI over the popular isoperimetric quotient approach in terms of (1) computational efficiency; (2) tolerance of positional uncertainty and irregular boundaries; (3) ability to handle shapes with holes and multiple parts; and (4) applicability and efficacy in districting/zonation/regionalization problems.
منابع مشابه
An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems
An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems Wenwen Li a , Michael F. Goodchild b & Richard Church b a School of Geographical Sciences and Urban Planning, GeoDa Center for Geospatial Analysis and Computation , Arizona State University , Tempe , AZ , USA b Department of Geography , University of California , Santa Barbara , CA , U...
متن کاملThe p-Compact-regions Problem
The p-compact-regions problem involves the search for an aggregation of n atomic spatial units into p-compact, contiguous regions. This article reports our efforts in designing a heuristic framework—MERGE (memory-based randomized greedy and edge reassignment) —to solve this problem through phases of dealing, randomized greedy, and edge reassignment. This MERGE heuristic is able to memorize (ME ...
متن کاملNew operators through measure of non-compactness
In this article, we use two concepts, measure of non-compactness and Meir-Keeler condensing operators. The measure of non-compactness has been applied for existence of solution nonlinear integral equations, ordinary differential equations and system of differential equations in the case of finite and infinite dimensions by some authors. Also Meir-Keeler condensing operators are shown in some pa...
متن کاملA method for 2-dimensional inversion of gravity data
Applying 2D algorithms for inverting the potential field data is more useful and efficient than their 3D counterparts, whenever the geologic situation permits. This is because the computation time is less and modeling the subsurface is easier. In this paper we present a 2D inversion algorithm for interpreting gravity data by employing a set of constraints including minimum distance, smoothness,...
متن کامل